UAV Formation Shape Control via Decentralized Markov Decision Processes
نویسندگان
چکیده
In this paper, we present a decentralized unmanned aerial vehicle (UAV) swarm formation control approach based on decision theoretic approach. Specifically, pose the UAV motion problem as Markov process (Dec-MDP). Here, goal is to drive from an initial geographical region another where must form three-dimensional shape (e.g., surface of sphere). As most decision-theoretic formulations suffer curse dimensionality, adapt existing fast approximate dynamic programming method called nominal belief-state optimization (NBO) approximately solve problem. We perform numerical studies in MATLAB validate performance above algorithms.
منابع مشابه
Policy Iteration for Decentralized Control of Markov Decision Processes
Coordination of distributed agents is required for problems arising in many areas, including multi-robot systems, networking and e-commerce. As a formal framework for such problems, we use the decentralized partially observable Markov decision process (DECPOMDP). Though much work has been done on optimal dynamic programming algorithms for the single-agent version of the problem, optimal algorit...
متن کاملThe Complexity of Decentralized Control of Markov Decision Processes
Planning for distributed agents with partial state information is considered from a decisiontheoretic perspective. We describe generalizations of both the MDP and POMDP models that allow for decentralized control. For even a small number of agents, the finite-horizon problems corresponding to both of our models are complete for nondeterministic exponential time. These complexity results illustr...
متن کاملRelaxation for Constrained Decentralized Markov Decision Processes
This paper studies a class of decentralized multi-agent stochastic optimization problems. In these problems, each agent has only a partial view of the world state, and a partial control of the actions but must cooperatively maximize the long-term system reward. The state that an agent observe consists of two parts a common public component and an agentspecific private component. Importantly, ta...
متن کاملSolving Transition Independent Decentralized Markov Decision Processes
Formal treatment of collaborative multi-agent systems has been lagging behind the rapid progress in sequential decision making by individual agents. Recent work in the area of decentralized Markov Decision Processes (MDPs) has contributed to closing this gap, but the computational complexity of these models remains a serious obstacle. To overcome this complexity barrier, we identify a specific ...
متن کاملAverage-Reward Decentralized Markov Decision Processes
Formal analysis of decentralized decision making has become a thriving research area in recent years, producing a number of multi-agent extensions of Markov decision processes. While much of the work has focused on optimizing discounted cumulative reward, optimizing average reward is sometimes a more suitable criterion. We formalize a class of such problems and analyze its characteristics, show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2021
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a14030091